Blind Matching Filtering Algorithm for Spectrum Sensing under Multi-Path Channel Environment

نویسندگان

چکیده

Matching filtering has been proven to be the optimal spectrum sensing algorithm under Gaussian white noise. However, application of this is limited because its dependence on prior information. In paper, we propose a based blind matching (BMF) by using correlation between adjacent received signals dispersive channels. Theoretical analysis shows that proposed can achieve performance comparable without requiring information primary user. Thus, superior detection performance. Moreover, an improved BMF (IBMF) basis different time-delay signals. IBMF utilizes more comprehensive and achieves better compared BMF. Furthermore, two algorithms have lower computational complexity than classical approaches covariance matrix Numerical simulations confirm detectors validate theoretical analysis.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Joint Design for Opportunistic Spectrum Access with Multi-Channel Sensing

Consider a spectrum of N orthogonal channels licensed to a slotted primary network. Let Sn(t) ∈ {0 (busy), 1 (idle)} denote the occupancy of channel n in slot t. We assume that the spectrum occupancy S(t) ∆ = [S1(t), . . . , SN(t)] follows a discrete-time homogeneous Markov process with finite state space S ∆ = {0, 1} and known transition probabilities {Ps,s′}s,s′∈S, where Ps,s′ ∆ = Pr{S(t+ 1) ...

متن کامل

Parallel Cooperative Spectrum Sensing Based on Genetic Algorithm for Heterogeneous Multi-channel Cognitive Network ?

To sense the spectrum efficiently in heterogeneous multi-channel and multi-user cognitive network, a parallel cooperative spectrum sensing strategy based on genetic algorithm is proposed. It defines the expression of system utility considering the transmission gain and sensing overhead, and protects the primary user network by introducing the penalty function. To obtain the largest system utili...

متن کامل

Traffic-Aware Multi-Channel Multi-Stage Spectrum Sensing Protocols for Dynamic Spectrum Access

of the Dissertation Traffic-Aware Multi-Channel Multi-Stage Spectrum Sensing Protocols for Dynamic Spectrum Access

متن کامل

Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment

A common algorithm to solve the shortest path problem (SPP) is the Dijkstra algorithm. In this paper, a generalized Dijkstra algorithm is proposed to handle SPP in an uncertain environment. Two key issues need to be addressed in SPP with fuzzy parameters. One is how to determine the addition of two edges. The other is how to compare the distance between two different paths with vailable online ...

متن کامل

Blind Compressive Sensing Framework for Collaborative Filtering

Existing works based on latent factor models have focused on representing the rating matrix as a product of user and item latent factor matrices, both being dense. Latent (factor) vectors define the degree to which a trait is possessed by an item or the affinity of user towards that trait. A dense user matrix is a reasonable assumption as each user will like/dislike a trait to certain extent. H...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2023

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics12112499